Performance Analysis of an AMC System with an Iterative V-BLAST Decoding Algorithm

نویسندگان

  • Sangjin Ryoo
  • Kyunghwan Lee
  • Intae Hwang
چکیده

In this paper, the iterative Vertical-Bell-lab Layered Space-Time (V-BLAST) decoding algorithm of an Adaptive Modulation and Coding (AMC) system is proposed, and the corresponding MIMO scheme is analyzed. The proposed decoding algorithm adopts iteratively extrinsic information from a Maximum A Posteriori (MAP) decoder as an a priori probability in the two decoding procedures of the V-BLAST scheme of ordering and slicing in an AMC system. Furthermore, the performance of the proposed decoding algorithm is compared with that of a conventional V-BLAST decoding algorithm and a Maximum Likelihood (ML) decoding algorithm in the combined system of an AMC scheme and a V-BLAST scheme. In this analysis, each MIMO schemes are assumed to be parts of the system for performance improvement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Throughput Improvement of Optimal Turbo Coded V-BLAST Technique in MIMO-AM System

In this paper, we propose and analyze an Adaptive Modulation System with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that adopts the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding as a priori probability in two decoding procedures of V-BLAST scheme; the ordering and the slicing. Also, we consider and compare The Adaptive Mo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Performance Analysis of a QR Decomposition Algorithm Employing Rearrangement of Antenna Layers on V-BLAST Systems

In a Rayleigh fading environment, the paper firstly introduces system model and the vertical Bell laboratories layered space-time (V-BLAST) systems structure. Several popular decoding algorithms for V-BLAST are carried on the analysis comparison, such as zero-foring (ZF), minimum mean squared error (MMSE), QR decomposition, and maximum likelihood (ML) etc. On this basis, the paper focuses on QR...

متن کامل

Low complexity post-ordered iterative decoding for generalized layered space-time coding systems

In this paper we refer to the combination of BLAST and space-time coding (STC) for multi-input multioutput systems as generalized layered space-time coding (GLST). Post-ordered decoding algorithm is introduced based on the generalization of the original BLAST ordering detection algorithm. The performance is analyzed through comparison to that of pre-ordered decoding with and without power alloc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJCNS

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2008